Self-Assembly and Self-Repair Algorithm for a Distributed Mechanical System
نویسندگان
چکیده
منابع مشابه
Self-assembly and self-repair method for a distributed mechanical system
We propose a self-assembly and self-repair method for a homogeneous distributed mechanical system. We focus on a category of distributed systems composed of numbers of identical units which can dynamically change connections among themselves. Each unit has an on-board microprocessor, and local communication between neighboring units is possible. In this paper, we discuss a distributed method fo...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولSelf-stabilizing algorithm for checkpointing in a distributed system
If the variables used for a checkpointing algorithm have data faults, the existing checkpointing and recovery algorithms may fail. In this paper, self-stabilizing data fault detecting and correcting, checkpointing, and recovery algorithms are proposed in a ring topology. The proposed data fault detection and correction algorithms can handle data faults; at most one per process, but in any numbe...
متن کاملA distributed self-stabilizing algorithm for argumentation
We propose a distributed approach to argumentation in which arguments are constructed by asynchronous processes which compute their own defeat status on the basis of local information. We present a self-stabilizing algorithm for the computation of defeat status, along with a proof of its correctness. The proposed approach introduces a remarkable flexibility in the management of argumentation ac...
متن کاملSelf-Assembly as Graph Grammar as Distributed System
In 2004, Klavins et al. introduced the use of graph grammars to describe—and to program— systems of self-assembly. It turns out that these graph grammars are a “dual notion” of a graph rewriting characterization of distributed systems that was proposed by Degano and Montanari over twenty years ago. By applying techniques obtained from this observation, we prove a generalized version of Soloveic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1997
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.33.424